Groups with an Abelian Sylow Subgroup
نویسندگان
چکیده
منابع مشابه
A REDUCTION THEOREM FOR UNil OF FINITE GROUPS WITH NORMAL ABELIAN SYLOW 2-SUBGROUP
Let F be a finite group with a Sylow 2-subgroup S that is normal and abelian. Using hyperelementary induction and cartesian squares, we prove that Cappell’s unitary nilpotent groups UNil∗(Z[F ];Z[F ],Z[F ]) have an induced isomorphism to the quotient of UNil∗(Z[S];Z[S],Z[S]) by the action of the group F/S. In particular, any finite group F of odd order has the same UNil-groups as the trivial gr...
متن کاملReduction of UNil for finite groups with normal abelian Sylow 2-subgroup
Let F be a finite group with a Sylow 2-subgroup S that is normal and abelian. Using hyperelementary induction and cartesian squares, we prove that Cappell’s unitary nilpotent groups UNil∗(Z[F ];Z[F ],Z[F ]) have an induced isomorphism to the quotient of UNil∗(Z[S];Z[S],Z[S]) by the action of the group F/S. In particular, any finite group F of odd order has the same UNil-groups as the trivial gr...
متن کاملOn $m^{th}$-autocommutator subgroup of finite abelian groups
Let $G$ be a group and $Aut(G)$ be the group of automorphisms of $G$. For any natural number $m$, the $m^{th}$-autocommutator subgroup of $G$ is defined as: $$K_{m} (G)=langle[g,alpha_{1},ldots,alpha_{m}] |gin G,alpha_{1},ldots,alpha_{m}in Aut(G)rangle.$$ In this paper, we obtain the $m^{th}$-autocommutator subgroup of all finite abelian groups.
متن کاملPolynomial-time Isomorphism Test for Groups with Abelian Sylow Towers
We consider the problem of testing isomorphism of groups of order n given by Cayley tables. The trivial nlogn bound on the time complexity for the general case has not been improved over the past four decades. Recently, Babai et al. (following Babai et al. in SODA 2011) presented a polynomial-time algorithm for groups without abelian normal subgroups, which suggests solvable groups as the hard ...
متن کاملsubgroup intersection graph of finite abelian groups
let $g$ be a finite group with the identity $e$. the subgroup intersection graph $gamma_{si}(g)$ of $g$ is the graph with vertex set $v(gamma_{si}(g)) = g-e$ and two distinct vertices $x$ and $y$ are adjacent in $gamma_{si}(g)$ if and only if $|leftlangle xrightrangle capleftlangle yrightrangle|>1$, where $leftlangle xrightrangle $ is the cyclic subgroup of $g$ generated by $xin g$. in th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1977
ISSN: 0002-9939
DOI: 10.2307/2041273